Combinatorial properties of a general domination problem with parity constraints
نویسندگان
چکیده
منابع مشابه
Combinatorial properties of a general domination problem with parity constraints
We consider various properties of a general parity domination problem: given a graph G, one is looking for a subset S of the vertex set such that the open/closed neighborhood of each vertex contains an even/odd number of vertices in S (it is prescribed individually for each vertex which of these applies). We define the parameter s(G) to be the number of solvable instances out of 4 possibilities...
متن کاملGraph matching as a combinatorial optimization problem with constraints
Let us introduce some notations. We will call GM = (VM , EM ) the model graph and GD = (VD, ED) the data graph which contains the image segments that have to be matched against GM , where Vi is the set of vertices and Ei is the set of edges of graph Gi (i = M,D). In inexact graph matching problems GD is assumed to contain more segments than GM , as that is the case when generated from an over-s...
متن کاملBonds with parity constraints
Given a connected graph G = (V,E) and three even-sized subsets A1, A2, A3 of V , when does V have a partition (S1, S2) such that G[Si] is connected and |Si ∩Aj | is odd for all i = 1, 2 and j = 1, 2, 3? This problem arises in the area of integer flow theory and has theoretical interest in its own right. The special case when |A1| = |A2| = |A3| = 2 has been resolved by Chakravarti and Robertson,...
متن کاملIndependent Sets with Domination Constraints
A ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that constrains how the independent set S can dominate the remaining vertices (∀v 6∈ S : |N(v) ∩ S| ∈ ρ.) For all values of ρ, we classify as either NP-complete or polynomial-time solvable the problems of deciding if a given graph has a ρ-independent set. We complement this with approximation algorithms and in...
متن کاملPlane Graphs with Parity Constraints
Let S be a set of n points in general position in the plane. Together with S we are given a set of parity constraints, that is, every point of S is labeled either even or odd. A graph G on S satisfies the parity constraint of a point p ∈ S, if the parity of the degree of p in G matches its label. In this paper we study how well various classes of planar graphs can satisfy arbitrary parity const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.005